B I O E N G I N E E R I N G Computational Modeling of Arterial Biomechanics

نویسندگان

  • DAVID A. VORP
  • DAVID A. STEINMAN
چکیده

The arteries deliver blood from the heart to tissues, while the veins return blood to the heart. Although we sometimes think of arteries and veins as simple tubes, in reality they are much more complex: they curve and branch, which profoundly influences blood flow and biomechanical forces within the arterial wall. The artery wall is composed of several types of cells that interact with each other and can respond to biomechanical forces. Computational tools help us better understand the relationship between arterial geometric complexity, arterial biomechanics, and arterial wall biology. Diseases of the artery wall are the leading cause of death in Western society and are thus a major public health problem. Unfortunately, the specific causative link between biomechanical factors and arterial disease remains unknown,1 partly because of the significant complexity of the highly unsteady, three-dimensional biomechanical environment within the arteries. One way that computational technology is advancing the understanding of vascular disease is to let us simulate and quantify the biomechanical environment in otherwise inaccessible locations. For example, it is now possible to noninvasively image the 3D structure of a living patient’s arteries, then simulate the biomechanical forces within those arteries with comparable or better accuracy than available through direct, invasive measurement.2,3 Such simulations, when coupled with appropriately designed experiments, play an important role in helping understand the links between biomechanics and arterial disease. They might one day even help plan surgery and assess patient-specific risks. When severe arterial disease develops, surgery is usually the preferred option. We can now implant an arsenal of paraphernalia into the circulatory system, including artificial heart valves, synthetic bypass graft, stents designed to keep the artery propped open, and coils designed to block off aneurysms. The difficulty is that these devices do not always work as well as they could and can fail after several years, with serious consequences. There are many reasons for failure, but biomechanical factors are once again important. Here is another area where computing can play a key role: It can help us design better cardiovascular devices while shortening design cycle time. COMPUTATIONAL MODELING OF ARTERIAL BIOMECHANICS

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amitraz Poisoning; A case study

A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...

متن کامل

Labeling Subgraph Embeddings and Cordiality of Graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.  For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...

متن کامل

Deciding Graph non-Hamiltonicity via a Closure Algorithm

We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...

متن کامل

تاثیر مرکزی هیستامین بر درد فرمالینی در خرگوش: نقش سیستم اپیوئیدی

.yiU s1 r qdJ 9 6!r.1 l,-r,iU 61 r,r1.11 ;oal il go,-7^19 ai f * *,-) S '*{'?'J*'fL' t:::tc: l/'2f /2 g.6;gb.t e*)* +r-,JifF.'L!.p"i9 r:.",ii:oul9+ 'Fft s ;J"r.pbjr;^*f- $ J9b +9 ll o;lr"iJ$!l odjUll Jt'56rlr2lr.! :rti9, ,(Jt;5) O*Jt"Jt i,;;ia.rJ1.pll oQr.i; nlCel ."r95f a+1,,r-..;ta 4..59L*yrtirlrcrbtUg i*r..p.259Fl'tfA,lflA.;lLirl,r6ek- 5r crrt!"rlr (efs.s..o' ) o*:..i1 Ji (.fsfefa),-;...

متن کامل

Counting the number of spanning trees of graphs

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

متن کامل

شناسایی دگرگونی ژنتیکی در ویروس تب برفکی تیپ A با استفاده از تعیین ردیف نوکلئوتیدی قسمتی از ژن VP1 ویروس

,1s1ya:.J'$n :7tb !9y.tu;1 9; q 5t'1& p I r lt 4!lr 9 61,; .l.iy c.!! ob lr+ : tt 4jr.'j .Al JLrob.;qrolr,J'fll t q ..rlaLr. 4 RT-PCR ri,Sle 1r o.ri 6bi!l Jt-t5 RIA :.pe, .pe1 *q&,.5b.'.;9; VPr Oijl ,r,iiqo-f .ddisl-t,r-a.ttJ nlceloltl Jlhr""gbyp,glrrsc*l . d,ri$ multiplexRT-PCR cycle sequencing cie) jlosu:pl t r PCR Jr-e .ri . 'r-JJl9; a{.Jt Fluorescent dye deoxy-terminator ar.bgy.5bai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001